A First-order Conditional Probability Logic with Iterations
نویسندگان
چکیده
We investigate a first-order conditional probability logic with equality, which is, up to our knowledge, the first treatise of such logic. The logic, denoted LFPOIC=, allows making statements such as: CP>s(φ, θ), and CP6s(φ, θ), with the intended meaning that the conditional probability of φ given θ is at least (at most) s. The corresponding syntax, semantic, and axiomatic system are introduced, and Extended completeness theorem is proven. 1. Syntax and semantics The recent papers [1, 3, 6], discuss conditional probability extensions of classic propositional logic, while [2] introduces a first-order conditional probability logic in which iterations of conditional probability operators are not allowed. In this paper, we abandon that restriction and also extend logical language by adding equality, which causes changes in the corresponding syntax and semantics. Solving those issues is the main novelty presented in this paper. Let [0, 1]Q denote the set of all rational numbers from the interval [0, 1]. The language L of the LFOICP-logic consists of countable sets of variables V ar = {x1, x2, . . .}, relation symbols R m i , the relation symbol = which is, of course, interpreted rigidly as equality, and function symbols F j , where m and n are arities of these symbols, logical connectives ∧ and ¬, the quantifier ∀, and binary conditional probability operators CP>s and CP6t for all s ∈ [0, 1]Q, t ∈ [0, 1)Q. Constants are function symbols whose arity is 0. Terms and atomic formulas are defined as in the first-order classical logic with equality. The set of formulas ForFOICP= is the smallest set containing atomic formulas and closed under the following formation rules: if φ and θ are formulas, then ¬φ, CP>s(φ, θ), CP6t(φ, θ), φ∧θ and (∀x)φ are formulas. We use the standard abbreviations for other connectives, while P>s(φ) denotes CP>s(φ,⊤). A formula 2010 Mathematics Subject Classification: 03B48, 03B042, 03B45. Partially supported by Ministarstvo prosvete i nauke Republike Srbije under grants III44006 and ON174026.
منابع مشابه
A Measure-Free Approach to Conditioning
In an earlier paper, a new theory of measurefree"conditional"objects was presented. In this paper, emphasis is placed upon the motivation of the theory. The central part of this motivation is established through an example involving a knowledge-based system. In order to evaluate combination of evidence for this system, using observed data, auxiliary at tribute and diagnosis variables, and infer...
متن کاملA Logic of Comparative Support: Qualitative Conditional Probability Relations Representable by Popper Functions
This article presents axioms for comparative conditional probability relations. The axioms presented here are more general than usual. Each comparative relation is a weak partial order on pairs of sentences (i.e. each relation is transitive and reflexive) but need not be a complete order relation. The axioms for these comparative relations are probabilistically sound for the broad class of cond...
متن کاملA Critical Examination of Ibn-Sina’s Theory of the Conditional Syllogism
This paper will examine Ibn Sina’s theory of the Conditional Syllogism from a purely logical point of view, and will lay bare the principles he adopted for founding his theory, and the reason why the newly introduced part of his logic remained undeveloped and eventually was removed from the texts of logic in the later Islamic tradition. As a preliminary discussion, this paper briefly examines I...
متن کاملNP-containment for the coherence test of assessments of conditional probability: a fuzzy logical approach
In this paper we investigate the problem of testing the coherence of an assessment of conditional probability following a purely logical setting. In particular we will prove that the coherence of an assessment of conditional probability χ can be characterized by means of the logical consistency of a suitable theory Tχ defined on the modal-fuzzy logic FPk(R L∆) built up over the many-valued logi...
متن کاملOn Prototypical Indifference and Lifted Inference in Relational Probabilistic Conditional Logic
Semantics for formal models of probabilistic reasoning rely on probability functions that are defined on the interpretations of the underlying classical logic. When this underlying logic is of relational nature, i. e. a fragment of first-order logic, then the space needed for representing these probability functions explicitly is exponential in both the number of predicates and the number of do...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013